On Merrifield-Simmons index of unicyclic graphs with given girth and prescribed pendent vertices
نویسندگان
چکیده
For a graph G, the Merrifield-Simmons index i(G) is defined as the total number of independent sets of the graph G. Let G(n, l, k) be the class of unicyclic graphs on n vertices with girth and pendent vertices being resp. l and k. In this paper, we characterize the unique unicyclic graph possessing prescribed girth and pendent vertices with the maximal Merrifield-Simmons index among all graphs in G(n, l, k).
منابع مشابه
On the Merrifield-Simmons index and Hosoya index of bicyclic graphs with a given girth
For a graph G, the Merrifield-Simmons index i(G) and the Hosoya index z(G) are defined as the total number of independent sets and the total number of matchings of the graph G, respectively. In this paper, we characterize the graphs with the maximal Merrifield-Simmons index and the minimal Hosoya index, respectively, among the bicyclic graphs on n vertices with a given girth g.
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملOn the Wiener Index of Unicyclic Graphs
The Wiener index of a graph G is defined as W (G) = ∑ u,v dG(u, v), where dG(u, v) is the distance between u and v in G, and the sum goes over all pairs of vertices. In this paper, we characterize the connected unicyclic graph with minimum Wiener indices among all connected unicyclic graphs of order n and girth g with k pendent vertices.
متن کاملTricyclic graphs with maximum Merrifield-Simmons index
It is well known that the graph invariant, ‘the Merrifield–Simmons index’ is important one in structural chemistry. The connected acyclic graphs with maximal and minimal Merrifield–Simmons indices are determined by Prodinger and Tichy [H. Prodinger, R.F. Tichy, Fibonacci numbers of graphs, Fibonacci Quart. 20 (1982) 16–21]. The sharp upper and lower bounds for theMerrifield–Simmons indices of u...
متن کاملSome extremal unicyclic graphs with respect to Hosoya index and Merrifield-Simmons index
The Hosoya index of a graph is defined as the total number of the matchings, including the empty edge set, of the graph. The Merrifield-Simmons index of a graph is defined as the total number of the independent vertex sets, including the empty vertex set, of the graph. Let U(n,∆) be the set of connected unicyclic graphs of order n with maximum degree ∆. We consider the Hosoya indices and the Me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 50 شماره
صفحات -
تاریخ انتشار 2011